Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
نویسندگان
چکیده
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actions. But even small real systems are never modeled directly as ordinary Petri nets: they use many high-level features that were designed as extensions of Petri nets. We focus here on two such features: colors and compositionality. We show that the symbolic unfolding of a product of colored Petri nets can be expressed as the product of the symbolic unfoldings of these nets. This is a necessary result in view of distributed computations based on symbolic unfoldings, as they have been developed already for standard unfoldings, to design modular verification techniques, or modular diagnosis procedures, for example. The factorization property of symbolic unfoldings is valid for several classes of colored or high-level nets. We derive it here for a class of (high-level) open nets, for which the composition is performed by connecting places rather than transitions.
منابع مشابه
Unfoldings of Unbounded Petri Nets
Net unfoldings have attracted much attention as a powerful technique for combating state space explosion in model checking. The method has been applied to veriication of 1-safe ((nite) Petri nets, and more recently also to other classes of nite-state systems such as synchronous products of nite transition systems. We show how unfoldings can be extended to the context of innnite-state systems. M...
متن کاملAccessibility Evaluation in Biometric Hybrid Architecture for Protecting Social Networks Using Colored Petri Nets
In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...
متن کاملComplete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a (symbolic and global) state graph, computable from a bounded net. An alternative is to consider a “partial order” semantics given in term of processes, which keep explicit the notions of causality and concurrency without comput...
متن کاملAccessibility Evaluation in Biometric Hybrid Architecture for Protecting Social Networks Using Colored Petri Nets
In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...
متن کاملCombining symbolic and partial order methods for model checking 1-safe Petri nets
In this work, methods are presented for model checking finite state asynchronous systems, more specifically 1-safe Petri nets, with the aim of alleviating the state explosion problem. Symbolic model checking techniques are used, combined with two partial order semantics known as net unfoldings and processes. We start with net unfoldings and study deadlock and reachability checking problems, usi...
متن کامل